Phase semantics for light linear logic
نویسندگان
چکیده
Light linear logic 1] is a reenement of the propositions-as-types paradigm to polynomial-time computation. A semantic setting for the underlying logical system is introduced here in terms of bred phase spaces. Strong completeness is established, with a purely semantic proof of cut elimination as a consequence. A number of mathematical examples of bred phase spaces are presented that illustrate subtleties of light linear logic.
منابع مشابه
A completeness theorem for symmetric product phase spaces
In a previous work with Antonio Bucciarelli, we introduced indexed linear logic as a tool for studying and enlarging the denotational semantics of linear logic. In particular, we showed how to define new denotational models of linear logic using symmetric product phase models (truth-value models) of indexed linear logic. We present here a strict extension of indexed linear logic for which symme...
متن کاملPhase Semantics and Veri cation of Concurrent Constraint
The class CC of concurrent constraint programming languages and its non-monotonic extension LCC based on linear constraint systems can be given a logical semantics in Girard's intuitionistic linear logic for a variety of observables. In this paper we settle basic completeness results and we show how the phase semantics of linear logic can be used to provide simple and very concise \semantical" ...
متن کاملSemantic Characterizations for Reachability and Trace Equivalence in a Linear Logic-Based Process Calculus (Preliminary Report)
We give semantic characterizations for the notions of reachability and trace equivalence in a linear-logic based framework of asyncronous concurrent process calculus. Usually the reachability relation in linear logic-based concurrent process calculi is characterized by the logical notion of provability, which is in turn characterized by model-theoretic semantics such as the phase semantics. The...
متن کاملIntuitionistic phase semantics is almost classical
We study the relationship between classical phase semantics for classical linear logic (LL) and intuitionistic phase semantics for intuitionistic linear logic (ILL). We prove that (i) every intuitionistic phase space is a subspace of a classical phase space, and (ii) every intuitionistic phase space is phase isomorphic to an “almost classical” phase space. Here, by an “almost classical” phase s...
متن کاملLinear Concurrent Constraint Programming: Operational and Phase Semantics
In this paper we settle a logical semantics for the class CC of concurrent constraint programming languages and for its extension LCC based on linear constraint systems. Besides the characterization in intuitionistic logic of the stores of CC computations, we show that both the stores and the successes of LCC computations can be characterized in intuitionistic linear logic. We illustrate the us...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 294 شماره
صفحات -
تاریخ انتشار 1997